Lagrange Multiplier Characterizations of Solution Sets of Constrained Nonsmooth Pseudolinear Optimization Problems

نویسندگان

  • Shashi Kant Mishra
  • B. B. Upadhyay
  • Le Thi Hoai An
چکیده

This paper deals with the minimization of a class of nonsmooth pseudolinear functions over a closed and convex set subject to linear inequality constraints. We establish several Lagrange multiplier characterizations of the solution set of the minimization problem by using the properties of locally Lipschitz pseudolinear functions. We also consider a constrained nonsmooth vector pseudolinear optimization problem and derive certain conditions, under which an efficient solution becomes a properly efficient solution. The results presented in this paper are more general than those existing in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizations of Optimal Solution Sets of Convex Infinite Programs

Several characterizations of solution sets of a class of convex infinite programs are given using Lagrange multiplier conditions. The results are then applied to some classes of optimization problems: cone-constrained convex programs and fractional programs. A class of semi-convex problems with convex constraints are also examined. Optimality conditions are obtained and several characterization...

متن کامل

Characterizations of solution sets of cone-constrained convex programming problems

In this paper, we consider a type of cone-constrained convex program in finitedimensional space, and are interested in characterization of the solution set of this convex program with the help of the Lagrange multiplier. We establish necessary conditions for a feasible point being an optimal solution. Moreover, some necessary conditions and sufficient conditions are established which simplifies...

متن کامل

Lagrange Multiplier Characterizations of Robust Best Approximations under Constraint Data Uncertainty∗

In this paper we explain how to characterize the best approximation to any x in a Hilbert space X from the set C ∩ {x ∈ X : gi(x) ≤ 0, i = 1, 2, · · · ,m} in the face of data uncertainty in the convex constraints, gi(x) ≤ 0, i = 1, 2, · · · ,m, where C is a closed convex subset of X. Following the robust optimization approach, we establish Lagrange multiplier characterizations of the robust con...

متن کامل

Karush-Kuhn-Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces

Lagrange multiplier rules for abstract optimization problems with mixed smooth and convex terms in the cost, with smooth equality constrained and convex inequality constraints are presented. The typical case for the equality constraints that the theory is meant for is given by differential equations. Applications are given to L-minimum norm control problems, L∞norm minimization, and a class of ...

متن کامل

Functional Analysis and Optimization

In this monograph we develop the function space method for optimization problems and operator equations in Banach spaces. Optimization is the one of key components for mathematical modeling of real world problems and the solution method provides an accurate and essential description and validation of the mathematical model. Optimization problems are encountered frequently in engineering and sci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Optimization Theory and Applications

دوره 160  شماره 

صفحات  -

تاریخ انتشار 2014